More Flexible Radial Layout
نویسندگان
چکیده
We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to the circumferences of a set of concentric circles around the origin. Such constraints frequently occur in the layout of social or policy networks, when structural centrality is mapped to geometric centrality, or when the primary intention of the layout is the display of the vicinity of a distinguished node. We extend stress majorization by a weighting scheme which imposes radial constraints on the layout but also tries to preserve as much information about the graph structure as possible.
منابع مشابه
A Particle Swarm Optimization Approach to Joint Location and Scheduling Decisions in A Flexible Job Shop Environment
In traditional scheduling literature, it is generally assumed that the location of facilities are predetermined and fixed in advance. However, these decisions are interrelated and may impact each other significantly. Therefore finding a schedule and facility location has become an important problem as an extension of the well-known scheduling problems. In this research we consider joint decisio...
متن کاملInProv: Visualizing Provenance Graphs with Radial Layouts and Time-Based Hierarchical Grouping
In provenance research, the large scale of data sets often complicates analysis and understanding. One solution is visualization, a tool that enables scientists and analysts to understand large data sets. The standard format for visualizing provenance is the node-link diagram. However, while effective for understanding local activity, the node-link diagram fails to offer a high-level summary of...
متن کاملAnisotropic Radial Layout for Visualizing Centrality and Structure in Graphs
This paper presents a novel method for layout of undirected graphs, where nodes (vertices) are constrained to lie on a set of nested, simple, closed curves. Such a layout is useful to simultaneously display the structural centrality and vertex distance information for graphs in many domains, including social networks. Closed curves are a more general constraint than the previously proposed circ...
متن کاملAn improved approach to find and rank BCC-efficient DMUs in data envelopment analysis (DEA)
Recently, a mixed integer data envelopment analysis (DEA) model has been proposed to find the most BCC-efficient (or the best) decision making unit (DMU) by Toloo (2012). This paper shows that the model may be infeasible in some cases, and when the model is feasible, it may fail to identify the most efficient DMU, correctly. We develop an improved model to find the most BCC-efficient DMU that r...
متن کاملAnimated Exploration of Dynamic Graphs with Radial Layout
We describe a new animation technique for supporting interactive exploration of a graph, building on the wellknown radial tree layout method. When a node is selected to become the center of interest, the visualization performs an animated transition to a new layout. Our approach makes the transition easy to follow by linearly interpolating the polar coordinates of the nodes and enforcing constr...
متن کامل